Attribute Reduction Based on Approximation Set of Rough Set ⋆

نویسندگان

  • Qinghua ZHANG
  • Yonglong GUO
  • Yu XIAO
  • Duoqian Miao
  • Guoying Wang
چکیده

Attribute reduction is one of the core issues of the rough set theory. The traditional method of attribute reduction was designed based on positive region unchanged, as abandoning processing the incompatible data in the boundary domain, so the classification characteristics of the reduction results are not necessarily best. In this paper, the concept of relative approximate degree is proposed in the decisionmaking information systems on the basis of the research on approximation set of rough set, the degree of similarity between the division of domain made by condition and division attribute is well reflected. Then the heuristic reduction attribute search criteria are using the changing of the relative approximate degree, the attribute reduction algorithm based on approximation set of rough set is proposed. The experimental results show that the reduction attribute obtained by the proposed method has better classification characteristics in the various classification algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

T-Rough Sets Based on the Lattices

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

متن کامل

ROUGH SET OVER DUAL-UNIVERSES IN FUZZY APPROXIMATION SPACE

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

متن کامل

Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

متن کامل

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

Rough ideals based on ideal determined varieties

The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014